Data Decisiveness, Missing Entries, and the DD Index
نویسندگان
چکیده
منابع مشابه
Clustering of Data with Missing Entries
The analysis of large datasets is often complicated by the presence of missing entries, mainly because most of the current machine learning algorithms are designed to work with full data. The main focus of this work is to introduce a clustering algorithm, that will provide good clustering even in the presence of missing data. The proposed technique solves an `0 fusion penalty based optimization...
متن کاملMissing Entries Matrix Approximation and Completion
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank approximations, similar algorithms appears recently in the literature under different names. In this work, we introduce new theorems for matrix approximation and show ...
متن کاملAn axiomatic characterization of the potential decisiveness index
Let us consider that somebody is extremely interested in increasing the probability of a proposal to be approved by a certain committee and let us assume that for achieving this goal he/she is prepared to pay off one member of the committee. In a situation like this one, and assuming that vote-buying is allowed and free of stigma, which voter should be offered a bribe? The potential decisivenes...
متن کاملStreaming PCA with Many Missing Entries
We consider the streaming memory-constrained principal component analysis (PCA) problem with missing entries, where the available storage is linear in the dimensionality of the problem, and each vector has so many missing entries that matrix completion is not possible. SVD-based methods cannot work because of the memory constraint, while imputation-based updates fail when faced with too many er...
متن کاملSparse Subspace Clustering with Missing Entries
We consider the problem of clustering incomplete data drawn from a union of subspaces. Classical subspace clustering methods are not applicable to this problem because the data are incomplete, while classical low-rank matrix completion methods may not be applicable because data in multiple subspaces may not be low rank. This paper proposes and evaluates two new approaches for subspace clusterin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cladistics
سال: 1999
ISSN: 0748-3007,1096-0031
DOI: 10.1111/j.1096-0031.1999.tb00392.x